Spectral dimension and random walks on the two dimensional uniform spanning tree
نویسندگان
چکیده
We study simple random walk on the uniform spanning tree on Z2. We obtain estimates for the transition probabilities of the random walk, the distance of the walk from its starting point after n steps, and exit times of both Euclidean balls and balls in the intrinsic graph metric. In particular, we prove that the spectral dimension of the uniform spanning tree on Z2 is 16/13 almost surely.
منابع مشابه
The loop - erased random walk and the uniform spanning tree on the four - dimensional discrete torus
Let x and y be points chosen uniformly at random from Z4n, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n(logn), resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on Z4n is the Brownian continuum random tree of Aldous. Our proofs use the techniq...
متن کامل4 A pr 1 99 9 The Upper Critical Dimension of the Abelian Sandpile Model
The existing estimation of the upper critical dimension of the Abelian Sandpile Model is based on a qualitative consideration of avalanches as self-avoiding branching processes. We find an exact representation of an avalanche as a sequence of spanning sub-trees of two-component spanning trees. Using equivalence between chemical paths on the spanning tree and loop-erased random walks, we reduce ...
متن کاملSubsequential scaling limits of simple random walk on the two-dimensional uniform spanning tree
The first main result of this paper is that the law of the (rescaled) two-dimensional uniform spanning tree is tight in a space whose elements are measured, rooted real trees continuously embedded into Euclidean space. Various properties of the intrinsic metrics, measures and embeddings of the subsequential limits in this space are obtained, with it being proved in particular that the Hausdor↵ ...
متن کاملConvergence of the Length of the Loop-erased Random Walk on Finite Graphs to the Rayleigh Process
Let (Gn) ∞ n=1 be a sequence of finite graphs, and let Yt be the length of a loop-erased random walk on Gn after t steps. We show that for a large family of sequences of finite graphs, which includes the case in which Gn is the d-dimensional torus of size-length n for d ≥ 4, the process (Yt) ∞ t=0, suitably normalized, converges to the Rayleigh process introduced by Evans, Pitman, and Winter. O...
متن کاملLoop-erased Random Walk on Finite Graphs and the Rayleigh Process
Let (Gn) ∞ n=1 be a sequence of finite graphs, and let Yt be the length of a loop-erased random walk on Gn after t steps. We show that for a large family of sequences of finite graphs, which includes the case in which Gn is the d-dimensional torus of size-length n for d ≥ 4, the process (Yt) ∞ t=0, suitably normalized, converges to the Rayleigh process introduced by Evans, Pitman, and Winter. O...
متن کامل